GCMTN: Low-Overlap Point Cloud Registration Network Combining Dense Graph Convolution and Multilevel Interactive Transformer

نویسندگان

چکیده

A single receptive field limits the expression of multilevel features in point cloud registration, leading to pseudo-matching objects with similar geometric structures low-overlap scenes, which causes a significant degradation registration performance. To handle this problem, network that incorporates dense graph convolution and mutilevel interaction Transformer (GCMTN) pursuit better performance scenes is proposed paper. In GCMTN, feature aggregation module designed for expanding points fusing at multiple scales. make pointwise more discriminative, combining Multihead Offset Attention Cross refine internal perform interaction. filter out undesirable effects outliers, an overlap prediction containing factor matching also determining match ability predicting region. The final rigid transformation parameters are generated based on distribution GCMTN was extensively verified publicly available ModelNet ModelLoNet, 3DMatch 3DLoMatch, odometryKITTI datasets compared recent methods. experimental results demonstrate significantly improves capability extraction achieves competitive scenes. Meanwhile, has value potential application practical remote sensing tasks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining the Strengths of Sparse Interest Point and Dense Im- age Registration for RGB-D Odometry

Visual odometry, i.e., estimating ego-motion from camera images, is frequently used as a building block in robot navigation systems. In this paper, we propose an efficient approach that provides robust and accurate visual odometry from RGB-D cameras in a wide range of settings. We seamlessly combine dense RGB-D image registration with the alignment of sparse interest points. While the former ap...

متن کامل

Comprehensive Analysis of Dense Point Cloud Filtering Algorithm for Eliminating Non-Ground Features

Point cloud and LiDAR Filtering is removing non-ground features from digital surface model (DSM) and reaching the bare earth and DTM extraction. Various methods have been proposed by different researchers to distinguish between ground and non- ground in points cloud and LiDAR data. Most fully automated methods have a common disadvantage, and they are only effective for a particular type of surf...

متن کامل

Graph and point cloud registration for tree-like structures: survey and evaluation

Graph and point cloud registration is a recurrent problem in computer vision related applications. In particular, we study the application of this problem for tree-like structures extracted from medical imaging. Often the texture information present in vessel and vascular structures is insufficient in order to match content in two or more images. One approach to this problem is to segment the s...

متن کامل

Dense Point Cloud Extraction From Oblique Imagery

With the increasing availability of low-cost digital cameras with small or medium sized sensors, more and more airborne images are available with high resolution, which enhances the possibility in establishing three dimensional models for urban areas. The high accuracy of representation of buildings in urban areas is required for asset valuation or disaster recovery. Many automatic methods for ...

متن کامل

Graph and point cloud matching for image registration PhD thesis proposal

In this document, we discuss the registration of images using graph and point cloud matching, with a special focus on medical imaging applications. Several parts of the human body present tree-like structures such as neuronal or pulmonary trees, retinal fundus, or blood vessels. There is a high interest in registering these structures due to many issues or limitations – acquiring images of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Remote Sensing

سال: 2023

ISSN: ['2315-4632', '2315-4675']

DOI: https://doi.org/10.3390/rs15153908